Abstract computational complexity and cycling computations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Complexity and Cycling

Computational Complexity and Cycling

متن کامل

On Inverse Halftoning: Computational Complexity and Interval Computations

Halftoning . . . Need for Reverse . . . Halftoning is an Ill. . . Inverse Halftoning: POCS Wavelet Inverse . . . Fast Inverse Halftoning What We Are . . . A General Problem General Problem: . . . Our First Result: . . . Reduction Proof Interval Computations Towards New Interval. . . New Algorithm: . . . New Algorithm: Cont-d New Algorithm: Details A POCS Iterative . . . Results and Future Work ...

متن کامل

Monotonic use of space and computational complexity over abstract structures

We use relational pointer machines as a framework for generalized computational complexity. Non-reuse of memory space, dubbed monotonic computing, is proposed as a fundamental concept that threads together various abstract generalizations of PTime. Depending on the use of space, relational machines generalize DLogSpace, PTime, NPTime and PSpace, We show that alternating first order machines are...

متن کامل

Computational Complexity of Iterated Maps on the Interval (Extended Abstract)

The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. As a main result, the computational complexity measure considered here is related to the...

متن کامل

The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks

We analyse the computational complexity of the recently proposed ideal semantics within abstract argumentation frameworks. It is shown that while typically less tractable than credulous admissibility semantics, the natural decision problems arising with this extension-based model can, perhaps surprisingly, be decided more efficiently than sceptical admissibility semantics. In particular the tas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1971

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(71)80030-2